When "exact recovery" is exact recovery in compressed sensing simulation
نویسنده
چکیده
In a simulation of compressed sensing (CS), one must test whether the recovered solution x̂ is the true solution x, i.e., “exact recovery.” Most CS simulations employ one of two criteria: 1) the recovered support is the true support; or 2) the normalized squared error is less than . We analyze these exact recovery criteria independent of any recovery algorithm, but with respect to signal distributions that are often used in CS simulations. That is, given a pair (x̂,x), when does “exact recovery” occur with respect to only one or both of these criteria for a given distribution of x? We show that, in a best case scenario, 2 sets a maximum allowed missed detection rate in a majority sense.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملSure independence screening and compressed random sensing
Compressed sensing is a very powerful and popular tool for sparse recovery of high dimensional signals. Random sensing matrices are often employed in compressed sensing. In this paper we introduce a new method named aggressive betting using sure independence screening for sparse noiseless signal recovery. The proposal exploits the randomness structure of random sensing matrices to greatly boost...
متن کاملA new result of the scaling law of weighted L1 minimization
Abstract—This paper study recovery conditions of weighted l1 minimization for signal reconstruction from compressed sensing measurements. A sufficient condition for exact recovery by using the general weighted l1 minimization is derived, which builds a direct relationship between the weights and the recoverability. Simulation results indicates that this sufficient condition provides a precise p...
متن کاملNew RIC Bounds via ` q - minimization with 0 < q ≤ 1 in Compressed Sensing
The restricted isometry constants (RICs) play an important role in exact recovery theory of sparse signals via `q(0 < q ≤ 1) relaxations in compressed sensing. Recently, Cai and Zhang [6] have achieved a sharp bound δtk < √ 1− 1/t for t ≥ 4 3 to guarantee the exact recovery of k sparse signals through the `1 minimization. This paper aims to establish new RICs bounds via `q(0 < q ≤ 1) relaxation...
متن کاملNew RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing
The restricted isometry constants (RICs) play an important role in exact recovery theory of sparse signals via `q(0 < q ≤ 1) relaxations in compressed sensing. Recently, Cai and Zhang [6] have achieved a sharp bound δtk < √ 1− 1/t for t ≥ 4 3 to guarantee the exact recovery of k sparse signals through the `1 minimization. This paper aims to establish new RICs bounds via `q(0 < q ≤ 1) relaxation...
متن کامل